Parametric models of local search progression
نویسندگان
چکیده
منابع مشابه
Parametric Local Multimodal Hashing for Cross-View Similarity Search
Recent years have witnessed the growing popularity of hashing for efficient large-scale similarity search. It has been shown that the hashing quality could be boosted by hash function learning (HFL). In this paper, we study HFL in the context of multimodal data for cross-view similarity search. We present a novel multimodal HFL method, called Parametric Local Multimodal Hashing (PLMH), which le...
متن کاملA Parametric Framework for Cooperative Parallel Local Search
In this paper we address the problem of parallelizing local search. We propose a general framework where different local search engines cooperate (through communication) in the quest for a solution. Several parameters allow the user to instantiate and customize the framework, like the degree of intensification and diversification. We implemented a prototype in the X10 programming language based...
متن کاملLocal parametric sensitivity for mixture models of lifetime distributions
Mixture models are receiving considerable significance in the last years. Practical situations in reliability and survival analysis may be addressed by using mixture models. When making inferences on them, besides the estimates of the parameters, a sensitivity analysis is necessary. In this paper, a general technique to estimate local prior sensitivities in finite mixtures of distributions from...
متن کاملHybrid Local Search on Two Multicolouring Models
This paper describes a hybrid local search approach to pure and bandwidth multicolouring problems. It compares two models of multicolouring: a 0/1 integer linear program, and a binary constraint satisfaction model derived by transforming multicolouring problems to colouring problems. The latter approach yields smaller models and competitive results.
متن کاملA novel local search method for microaggregation
In this paper, we propose an effective microaggregation algorithm to produce a more useful protected data for publishing. Microaggregation is mapped to a clustering problem with known minimum and maximum group size constraints. In this scheme, the goal is to cluster n records into groups of at least k and at most 2k_1 records, such that the sum of the within-group squ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Transactions in Operational Research
سال: 2009
ISSN: 0969-6016,1475-3995
DOI: 10.1111/j.1475-3995.2009.00722.x